Global asymptotic stability of max-min congestion control schemes
نویسندگان
چکیده
A number of congestion control schemes which adopt the max-min fairness criterion and do not require maintenance of per flow states within the network have been proposed in literature. The stability of some of these schemes in networks of arbitrary topology, has been established analytically only for small deviations about the equilibrium point. The establishment of global asymptotic stability remained an open challenging research topic. In this paper we show global asymptotic stability for a decentralized max-min congestion controller which does not maintain per flow states within the network. In particular, we show that a max-min congestion control scheme applied to a network of arbitrary topology, guarantees that the user sending rates converge asymptotically to the max-min allocation values for any arbitrary feasible initial condition. The paper resolves a long standing research problem in this field.
منابع مشابه
Global Asymptotic Stability of a Max-Min Congestion Control Scheme
A number of congestion control schemes which adopt the max-min fairness criterion and do not require maintenance of per flow states within the network have been proposed in literature. The stability of some of these schemes in networks of arbitrary topology, has been established analytically only for small deviations about the equilibrium point. The establishment of global asymptotic stability ...
متن کاملRouting-Based Video Multicast Congestion Control
Congestion control is critical for a multicast transport protocol to be deployed and coexist fairly with current unicast transport protocols, such as TCP. We present a new congestion control protocol for video multicast: Routingbased Video Multicast Congestion Control (RVMCC), which combats congestion from a new direction: enriching abstractions of the routing layer. RVMCC overcomes most of the...
متن کاملEdge-to-Edge Aggregate Flow Control for the Internet
We present an edge-to-edge flow control scheme which enables an ISP to achieve weighted max-min fair bandwidth allocation among all source-destination pairs on a per-aggregate basis within its network. The motivation behind the scheme is the absence of per-aggregate flow control in the current Internet, resulting in inability to enforce a certain fairness on source-destination flows. The propos...
متن کاملMaxNet: an efficient max-min fair allocation scheme
It has been analytically proved that both MaxNet and SumNet can achieve max-min fair allocation in static networks. In SumNet networks, such as the TCP algorithm of the current Internet, the source rate is controlled by congestion signal which is the sum of signals from all of the congested links along the path from the source to the destination. In MaxNet networks, only the most congested link...
متن کاملMaxNet: An Efficient Max-Mi Fair Allocati n Scheme
It has been analytically proved that both MaxNet and SumNet can achieve m allocation in static networks. In SumNet networks, such as the TCP algorithm of the current I source rate is controlled by congestion signal which is the sum of signals from all of the congest along the path from the source to the destination. In MaxNet networks, only the most co generates the control signal to dictate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IMA J. Math. Control & Information
دوره 34 شماره
صفحات -
تاریخ انتشار 2017